A primal–dual interior point method for a novel type-2 second order cone optimization

نویسندگان

چکیده

In this paper, we define a new, special second order cone as type-$k$ cone. We focus on the case of $k=2$, which can be viewed SOCO with an additional {\em complicating variable}. For new problem, develop necessary prerequisites, based previous work for traditional SOCO. then primal-dual interior point algorithm solving type-2 conic optimization (SOCO) family kernel functions suitable finally derive following iteration bound our framework: \[\frac{L^\gamma}{\theta \kappa \gamma} \left[2N \psi\left( \frac{\varrho \left(\tau /4N\right)}{\sqrt{1-\theta}}\right)\right]^\gamma\log \frac{3N}{\epsilon}.\]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A full Nesterov-Todd step interior-point method for circular cone optimization

In this paper, we present a full Newton step feasible interior-pointmethod for circular cone optimization by using Euclidean Jordanalgebra. The search direction is based on the Nesterov-Todd scalingscheme, and only full-Newton step is used at each iteration.Furthermore, we derive the iteration bound that coincides with thecurrently best known iteration bound for small-update methods.

متن کامل

A new Primal-Dual Interior-Point Algorithm for Second-Order Cone Optimization∗

We present a primal-dual interior-point algorithm for second-order conic optimization problems based on a specific class of kernel functions. This class has been investigated earlier for the case of linear optimization problems. In this paper we derive the complexity bounds O( √ N (logN) log N ) for largeand O( √ N log N ) for smallupdate methods, respectively. Here N denotes the number of seco...

متن کامل

A logarithmic barrier interior-point method based on majorant functions for second-order cone programming

We present a logarithmic barrier interior-point method for solving a second-order cone programming problem. Newton’s method is used to compute the descent direction, and majorant functions are used as an efficient alternative to line search methods to determine the displacement step along the direction. The efficiency of our method is shown by presenting numerical experiments.

متن کامل

Implementation of interior point methods for mixed semidefinite and second order cone optimization problems

There is a large number of implementational choices to be made for the primal-dual interior point method in the context of mixed semidefinite and second order cone optimization. This paper presents such implementational issues in a unified framework, and compares the choices made by different research groups. This is also the first paper to provide an elaborate discussion of the implementation ...

متن کامل

A primal-dual interior point method for nonlinear optimization over second-order cones

In this paper, we are concerned with nonlinear minimization problems with second order cone constraints. A primal-dual interior point method is proposed for solving the problems. We also propose a new primal-dual merit function by combining the barrier penalty function and the potential function within the framework of the line search strategy, and show the global convergence property of our me...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Results in control and optimization

سال: 2021

ISSN: ['2666-7207']

DOI: https://doi.org/10.1016/j.rico.2021.100042